Progress with Java threads as dining philosophers
نویسنده
چکیده
The classical problem of the dining philosphers is solved and implemented with Java threads, without central coordination. Apart from the initialization the program is symmetric. The philosophers are the synchronized objects whereas the forks between the philosophers are unsynchronized. It is proved that every hungry philosopher eats within bounded delay, in a certain formalized sense.
منابع مشابه
A Structured Approach for Developing Concurrent Programs in Java
In recent years, concurrent programming has become the norm rather than the exception in many applications. In particular, popularity of the Java programming language has accelerated this trend. Most textbooks on Operating Systems and concurrent programming teach concurrent programming by demonstrating solutions for some well-known problems, such as the producer/consumer, readers/writers, and d...
متن کاملA Translator of Java Programs to TADDs
The model checking tools Uppaal and VerICS accept a description of a network of Timed Automata with Discrete Data (TADDs) as input. Thus, to verify a concurrent programwritten in Java by means of these tools, first a TADD model of the program must be build. Therefore, we have developed the J2TADD tool that translates a Java program to a network of TADDs; the paper presents this tool. The J2TADD...
متن کامل1 Wissenheim – an Interactive 3 D - World � for Leisure and Learning �
Wissenheim is a virtual 3D world offering a blended mixture of learning and leisure for our computer science students. It demonstrates important concepts from the course on „Technical Informatics“ and at the same time offers a social platform for the students. Wissenheim multi-user scenarios can run either as standard Java-applets in a browser, as shared memory applications under XtreemOS(TM) (...
متن کاملPetri Nets as Integrated Modelling Techniques
3 Review of Place/Transition Nets 8 3.1 “Dining Philosophers” as PT Net . . . . . . . . . . . . . . . . . . 8 3.2 Place/Transition Nets . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3 Marking Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.4 A “Dining Philosophers” Process . . . . . . . . . . . . . . . . . . 12 3.5 Occurence Nets and Processes . . . . . . . . . . . . . ....
متن کاملDistributed Diners From UNITY Speci cation to CC Implementation
Resource con icts may typically be described as the dining philoso phers problem or diners for short In this report we derive a distributed message passing solution to the diners problem from the shared memory solution presented in CM Ch Dining Philosophers We de ne an isomorphism between variables in the shared memory state and variables in the distributed state This allows us to translate the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001